CPU scheduling algorithms require CPU time and IO time required for its execution. CPU time is time taken by CPU to carry out the process while I/O time illustrates the time required for I/O operation by the process....
Seek Time:
A disk is divided into many circular tracks. Seek Time is defined as the time required by the read/write head to move from one track to another....
Round 1: It starts after the prescreening process is done. Almost all the students from all the campuses of SRM made their way to this round....
A directory in a computer system is like a container, through which files and folders store data. Just like a room or space is required to keep goods in a shop, similarly a directory is required to store files folder in a computer. In this article, we are going to discuss two-level directories and also we will see their advantages and disadvantages. So, let’s get started:-...
The design of an operating system is a broad and complex topic that touches on many aspects of computer science. This article will cover the design of operating systems in general and then focus on the implementation aspect....
1. Fragmentation :Fragmentation, as name suggests, is basically a process in which free memory space is broken into little pieces. In this, memory blocks cannot be allocated to processes due to their small size and such blocks remain unused. It usually occurs in dynamic memory allocation system when many of free blocks are too small to satisfy any request....
1. Local File System (LFS) :
The basic file system of Linux operating system is termed as Local file system. It stores any data file as it is in single copy.
It stores data files in Tree format. Here, any user can access data files directly. LFS does not Replicate the data blocks. It always used for storing and processing personal data(small data)....
CD stands for Compact Disc was the primary step towards the thought of digital coding of the info...
In this article, we will discuss how to wake up a std::thread while it is sleeping. It is known that a thread can’t be exited when it is sleeping. So it is woken up using a command as:...
Simplest CPU scheduling algorithm that schedules according to arrival times of processes. The first come first serve scheduling algorithm states that the process that requests the CPU first is allocated the CPU first. It is implemented by using the FIFO queue. When a process enters the ready queue, its PCB is linked to the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue. The running process is then removed from the queue. FCFS is a non-preemptive scheduling algorithm....
MS-DOS which is short for Microsoft Disk Operating System is a non-graphical command line operating system developed for IBM compatible computers with x86 microprocessor. The operating system used a command line interface for the user to input commands to navigate, open and manipulate files on their computer....
